Eliminating past operators in Metric Temporal Logic
نویسندگان
چکیده
We consider variants of Metric Temporal Logic (MTL) with the past operators S and SI . We show that these operators can be “eliminated” in the sense that for any formula in these logics containing the S and SI modalities, we can give a formula over an extended set of propositions which does not contain these past operators, and which is equivalent to the original formula modulo a projection onto the original set of propositions. These results have implications with regard to decidability and closure under projection for the logics we consider.
منابع مشابه
On the Expressiveness of MTL with Past Operators
We compare the expressiveness of variants of Metric Temporal Logic (MTL) obtained by adding the past operators ‘S’ and ‘SI ’. We consider these variants under the “pointwise” and “continuous” interpretations over both finite and infinite models. Among other results, we show that for each of these variants the continuous version is strictly more expressive than the pointwise version. We also pro...
متن کاملOn-Line Monitoring for Temporal Logic Robustness
In this paper, we provide a Dynamic Programming algorithm for online monitoring of the state robustness of Metric Temporal Logic specifications with past time operators. We compute the robustness of MTL with unbounded past and bounded future temporal operators (MTL<+∞ +pt ) over sampled traces of Cyber-Physical Systems. We implemented our tool in Matlab as a Simulink block that can be used in a...
متن کاملThe Temporal Rover and the ATG Rover
The Temporal Rover is a specification based verification tool for applications written in C, C++, Java, Verilog and VHDL. The tool combines formal specification, using Linear-Time Temporal Logic (LTL) and Metric Temporal Logic (MTL), with conventional simulation/execution based testing. The Temporal Rover is tailored for the verification of complex protocols and reactive systems where behavior ...
متن کاملQuantitative temporal logics over the reals: PSpace and below
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitative TLs are complete for NP or PSpace, their metric extensions are often ExpSpace-complete or even undecidable. In this paper, we exhibit several metric extensions of qualitative TLs of the real line that are at most PS...
متن کاملLinear-time Temporal Logic with Event Freezing Functions
Formal properties represent a cornerstone of the system-correctness proofs based on formal verification techniques such as model checking. Formalizing requirements into temporal properties may be very complex and error prone, due not only to the ambiguity of the textual requirements but also to the complexity of the formal language. Finding a property specification language that balances simpli...
متن کامل